A new formal tool: functorial variables representing assertions and presuppositions
نویسنده
چکیده
The language of classical propositional iog-Ic is extended by functorial variables as a new syntactical category. Functorial variables render to be a possible integrating representation of both assertion and presup-position in one and the same logical formula different from such using classical conjunction. O~ Introduction From a computational point of vlew there is an important difficulty of an adequate formalization of both assertion and presup-position, It rests on dividing utterances into an explicit part (assertion) and an implicit one (presupposition). Frege 118921 refused any explication of this implicit part, because of hls ideallza= t/on that logic deals only with correct ~tatemerlts. At least in regard of definite descriptions Russell /1905/ pleaded for such an explication. But classical conjunction was one of its essential formal tools. To a certain extent assertion and presuppoeltion were represented at one and the same level. Strawson /1950/ claimed that presuppositions have to be explicated, but not at the same level like the implicit part. Many linguists = e, g. Klefer 11973/-believe that logical means can be used to represent both parts of utterances aeparately~ but these representations cannot be put together in one and the same logical expreeslon~ because Russell's solution Is unsatisfactory. My intention is to show that functorlal variables render to be possible tools for integrating representation of both assertion and presupposition in one and the same logical formula, Moreover-unlike Bergmann i1981/, OunglKOstner /19861-this representation Is a svntactlcal one and different from that given by means of classical conJunction (cp, Max l1986/i /forthcoming/). 1. The logical apparatus 1,1~ Functors as classical functions n Let ~t be the form of n-placed propositional 2n functors; 1 ~ t ~ 2 ~ I will use 1-and 2-placed functors only, These functors are interpreted as classical (i. e, 2-valued end extensional) functions, The value-tables are= 0 0 0 0 1.2, Functorlal variables I introduce functorial variables as e ne~ pyntactlcal category, and take the classical functors as values of these variables. Introducing such variables we get a whole class of syntactical extensions of the classical pro-positional logic. Only functorlal varlablee of the following form are considered= G~=gi_ I ~ f,g ~ 16. The f's and g's are called components. The f-component (g-component) is called first (second) component. are values of 2 Semantically, ~ and ~gG2 the functorial variables f,g. Therefore these functorlal variables (abbreviation= FV's) represent eats of functors wlth exact two (not necessarily different) elements. Wlth …
منابع مشابه
The Semantics and Pragmatics of Presupposition
In this paper, we offer a novel analysis of presuppositions, paving particular attention to the interaction between the knowledge resources that are required to interpret them. The analysis has two main features. First, we capture an analogy between presuppositions, anaphora and scope ambiguity (cf. van der Sandt 1992), by utilizing semantic underspecification (c£ Reyle 1993). Second, resolving...
متن کاملModeling and Evaluation of Stochastic Discrete-Event Systems with RayLang Formalism
In recent years, formal methods have been used as an important tool for performance evaluation and verification of a wide range of systems. In the view points of engineers and practitioners, however, there are still some major difficulties in using formal methods. In this paper, we introduce a new formal modeling language to fill the gaps between object-oriented programming languages (OOPLs) us...
متن کاملModeling and Evaluation of Stochastic Discrete-Event Systems with RayLang Formalism
In recent years, formal methods have been used as an important tool for performance evaluation and verification of a wide range of systems. In the view points of engineers and practitioners, however, there are still some major difficulties in using formal methods. In this paper, we introduce a new formal modeling language to fill the gaps between object-oriented programming languages (OOPLs) us...
متن کاملPresupposition Projection and Accommodation in Mathematical Texts
This paper discusses presuppositions in mathematical texts and describes how presupposition handling was implemented in the Naproche system for checking natural language mathematical proofs. Mathematical texts have special properties from a pragmatic point of view, since in a mathematical proof every new assertion is expected to logically follow from previously known material, whereas in most o...
متن کاملA Study of the Effectiveness of Using Formal Specifications to Create Assertions
Though the software engineering industry is relatively new, software has become pervasive in modern society. Despite the fact that software is commonplace today, it often proves to be prone to error and generally undependable. When software does fail, the consequences can be as bad as from loss of revenue to loss of life. Software testing is a common defense against such failures. The key goal ...
متن کامل